Solution of diffusion limited aggregation in a narrow cylindrical geometry
نویسندگان
چکیده
منابع مشابه
Diffusion-limited aggregation in channel geometry.
We performed extensive numerical simulation of diffusion-limited aggregation in two-dimensional channel geometry. Contrary to earlier claims, the measured fractal dimension D=1.712+/-0.002 and its leading correction to scaling are the same as in the radial case. The average cluster, defined as the average conformal map, is similar but not identical to Saffman-Taylor fingers.
متن کاملSlippery diffusion-limited aggregation.
Colloidal particles that interact through strong, short-range, secondary attractions in liquids form irreversible "slippery" bonds that are not shear-rigid. Through event-driven simulations of slippery attractive spheres, we show that space-filling fractal clusters still emerge from the process of "slippery" diffusion-limited aggregation (DLA). Although slippery and classic DLA clusters have th...
متن کاملAdvection-diffusion-limited aggregation.
Much is known about diffusion-limited growth from a dilute suspension. The simplest and most famous model is diffusion-limited aggregation (DLA), in which random walkers are released one-by-one far away and become frozen where they first touch a growing fractal cluster. Real growth phenomena, such as mineral deposition in rocks, however, often involve multiple processes, such as advection-diffu...
متن کاملComposite Diffusion Limited Aggregation Paintings
Diffusion limited aggregation (DLA) is a modelling technique for simulating dendritic growth that has seen widespread application in the physical, biological, and social sciences. We introduce an artistic component to the basic technique by adding special effects parameters to a single particle, random walk DLA aggregation scheme. Our goal is to explore the potential of the enhanced scheme as a...
متن کاملDiffusion Limited Aggregation on a Cylinder
We consider the DLA process on a cylinder G × N. It is shown that this process “grows arms”, provided that the base graph G has small enough mixing time. Specifically, if the mixing time of G is at most log(2−ε) |G|, the time it takes the cluster to reach the m-th layer of the cylinder is at most of order m · |G| log log|G| . In particular we get examples of infinite Cayley graphs of degree 5, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 1998
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.58.4716